Universal quantification as iterated conjunction
نویسندگان
چکیده
I analyze distributive universal quantifiers like ‘each’ and ‘every’ in terms of iterated dynamic update. I argue that this minor adjustment to standard dynamic setups has at least two empirical advantages. First, because information flows forward through the universal computation, anaphoric elements can assume “quantifier-internal” interpretations [1]. Second, because conjunction is usually analyzed as relation composition over input and output structures, the emerging representations are in a sort of disjunctive normal form that facilitates “functional” readings of indefinites. Following [13], I suggest that these two phenomena are closely related, and argue that the current approach which generates the two readings via the same compositional mechanism is simpler, more general, and more empirically adequate than the alternatives.
منابع مشابه
Recursive Random Fields
A formula in first-order logic can be viewed as a tree, with a logical connective at each node, and a knowledge base can be viewed as a tree whose root is a conjunction. Markov logic [Richardson and Domingos, 2006] makes this conjunction probabilistic, as well as the universal quantifiers directly under it, but the rest of the tree remains purely logical. This causes an asymmetry in the treatme...
متن کاملA Unified Approach to Questions, Quantifiers and Coordination in Japanese
Universal/existential quantifiers can be seen as generalization of logical conjunction/disjunction. The universal (existential) quantification of an open proposition is the conjunction (disjunction) of all its possible instantiations. In other words, conjunction (disjunction) is a special kind of universal (existential) quantification where the domain of the variable is restricted to the set of...
متن کاملAutomatic Verification of Iterated Separating Conjunctions Using Symbolic Execution
In permission logics such as separation logic, the iterated separating conjunction is a quantifier denoting access permission to an unbounded set of heap locations. In contrast to recursive predicates, iterated separating conjunctions do not prescribe a structure on the locations they range over, and so do not restrict how to traverse and modify these locations. This flexibility is important fo...
متن کاملAttractors of Iterated Function Systems
In this paper, the question of which compact metric spaces can be attractors of hyperbolic iterated function systems on Euclidean space is studied. It is shown that given any finite-dimensional compact metric X , there is a Cantor set C such that the disjoint union of C and X is an attractor. In the process, it is proved that every such X is the Lipschitz image of a Cantor set.
متن کاملThe quantifier complexity of polynomial-size iterated definitions in first-order logic
We refine the constructions of Ferrante-Rackoff and Solovay on iterated definitions in first-order logic and their expressibility in with polynomial size formulas. These constructions introduce additional quantifiers; however, we show that these extra quantifiers range over only finite sets. We prove optimal upper and lower bounds on the quantifier complexity of polynomial size formulas obtaine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013